An Object-Oriented Framework for Multiobjective Local Search
نویسندگان
چکیده
A growing attention has been devoted in recent years to optimisation in multiobjective contexts. As part of this increasing interest, metaheuristics are being adapted to handle multiple objectives, in an effort that has been motivated by the success of metaheuristics in single-objective contexts. Also as a result of significant recent attention, a number of object-oriented approaches for single-objective metaheuristics have been proposed, mainly aiming at bringing theory and application in this field closer, and facilitating the implementation and comparison of methods.
منابع مشابه
Comparison between MOEA/D and NSGA-II on the Multiobjective Travelling Salesman Problem
Most multiobjective evolutionary algorithms are based on Pareto dominance for measuring the quality of solutions during their search, among them NSGA-II is well-known. A very few algorithms are based on decomposition and implicitly or explicitly try to optimize aggregations of the objectives. MOEA/D is a very recent such an algorithm. One of the major advantages of MOEA/D is that it is very eas...
متن کاملEASYLOCAL++: An object-oriented framework for flexible design of local search algorithms
Local search is an optimization paradigm that has recently gained interest also in the constraint programming community as a method to improve constraint-based search strategies. We present EASYLOCAL++, an object-oriented framework to be used as a general tool for the development of local search algorithms. The abstract classes that compose the framework specify and implement the invariant part...
متن کاملA Simple yet Efficient Multiobjective Combinatorial Optimization Method Using Decomposition and Pareto Local Search
Combining ideas from evolutionary algorithms, decomposition approaches and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: MoMad. It decomposes a combinatorial multiobjective problem into a number of single objective optimization problems using an aggregation method. MoMad evolves three populations: popula...
متن کاملEasyLocal++: an object-oriented framework for the flexible design of local-search algorithms
Local search is a paradigm for optimization which has been recently shown to be very effective for a large number of combinatorial problems. Differently from other search paradigms, e.g. branch & bound, no widely-accepted software tool is available up to now for local search. We present EasyLocal++, an object-oriented framework to be used as a flexible tool for the development of local search a...
متن کاملChapter 1 WRITING LOCAL SEARCH ALGORITHMS USING EasyLocal + +
EasyLocal++ is an object-oriented framework that helps the user to design and implement local search algorithms in C++ for a large variety
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001